Model-Checking for Extended Timed Temporal Logics

We introduce the real-time temporal logic BTATL p which is obtained by extending CTL with both past operators and timed automata constraints. Considering together past operators and automata constraints allows expressing timing requirements in a simple and natural way. Model-checking for full BTATL p is undecidable. Fortunately, there exist signiicant (both linear-time and branching-time) fragments for which the veriication problem is decidable. In particular, we identify a sublogic of BTATL p , which is more expressive than TCTL, and for which model-checking can be eeectively done. The practical interest of this logic is illustrated through the example of the Philips audio protocol.